Michigan vs. Pittsburgh Style GA Optimisation of Fuzzy Rule Bases for Gene Expression Analysis

نویسندگان

  • Gerald Schaefer
  • Tomoharu Nakashima
چکیده

Microarray studies and gene expression analysis have received a lot of attention and provide many promising avenues towards the understanding of fundamental questions in biology and medicine. In this paper, the authors perform gene expression analysis and apply two hybrid GA-fuzzy approaches to classify gene expression data. Both are based on fuzzy if-then rule bases but they differ in the way these rule bases are optimised. The authors employ both a Michigan style approach, where single rules are handled as individuals in the population of the genetic algorithm, and a Pittsburgh type algorithm, which treats whole rule sets as individuals. Experimental results show that both approaches achieve good classification accuracy but that the Michigan style algorithm clearly outperforms the Pittsburgh classifier. Michigan vs. Pittsburgh Style GA Optimisation of Fuzzy Rule Bases for Gene Expression Analysis

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autonomous Acquisition of Fuzzy Rules for Mobile Robot Control: First Results from two Evolutionary Computation Approaches

We describe two architectures that autonomously acquire fuzzy control rules to provide reactive behavioural competencies in a simulated mobile robotics application. One architecture is a “Pittsburgh”-style Fuzzy Classifier System (Pitt1). The other architecture is a “Michigan”style Fuzzy Classifier System (Mich1). We tested the architectures on their ability to acquire an “investigative” obstac...

متن کامل

Flexible Fuzzy Rule Bases Evolution with Swarm Intelligence for Meta-Scheduling in Grid Computing

Fuzzy rule-based systems are expert systems whose performance is strongly related to the quality of their knowledge and the associated knowledge acquisition processes and thus, the design of effective learning techniques is considered a critical and major problem of these systems. Knowledge acquisition with a swarm intelligence approach is a recent learning strategy for the evolution of fuzzy r...

متن کامل

A fuzzy theory refinement algorithm 1

A fuzzy theory refinement algorithm composed of a heuristic process of generalization, specification, addition and elimination of rules is proposed. This refinement algorithm can be applied to knowledge bases obtained from several sources (learning algorithms, experts), but its development is strongly associated with the SLAVE learning system. SLAVE was developed for working with noise-affected...

متن کامل

Linguistic Rule Extraction by Genetics-Based Machine Learning

This paper shows how linguistic classification knowledge can be extracted from numerical data for pattern classification problems with many continuous attributes by genetic algorithms. Classification knowledge is extracted in the form of linguistic if-then rules. In this paper, emphasis is placed on the simplicity of the extracted knowledge. The simplicity is measured by two criteria: the numbe...

متن کامل

On Generalisation in Michigan-Style Fuzzy Classifier Systems

The ability of a rule-based system to represent generalisations is of great importance. Generalised rules allow more compact rule bases, scalability to higher dimensional spaces, faster inference and better linguistic interpretability. The issue of rule generalisation, and the interplay between general and specific rules in the same evolving population, has received a great deal of attention in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJFSA

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2013